Concurrent O-O Programming in Java

نویسنده

  • D. Holmes
چکیده

David Holmes is a Senior Research Scientist at the Cooperative Research Centre for Enterprise Distributed Systems Technology (DSTC Pty Ltd), in Brisbane, Australia. He completed his Ph.D in the area of synchronization within object-oriented system and has been involved in concurrent programming for a number of years. He is a co-author of the third edition of the Java Series book “The Java Programming Language.”

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Compiling for Concise Code and Ecient I/O

Large infrastructures of Internet companies, such as Facebook and Twitter, are composed of several layers of microservices. While this modularity provides scalability to the system, the I/O associated with each service request strongly impacts its performance. In this context, writing concise programs which execute I/O e�ciently is especially challenging. In this paper, we introduce Ÿauhau, a n...

متن کامل

ACT + + 2 . 0 : A Class Library for Concurrent Programming in C + + Using Actors

ACT++ 2.0 is the most recent version of a class library for concurrent programming in C++. The underlying model of concurrent computation is the Actor model. Programs in ACT++ consist of a collection of active objects called actors. Actors execute concurrently and cooperate by sending request and reply messages. An agent, termed the behavior of an actor, is responsible for processing a single r...

متن کامل

Mutant Operators for Testing Concurrent Java Programs

Mutation testing is a fault-based testing technique that has been widely studied in the last decades. One reason for the interest of the scientific community in mutation testing is its flexibility. It can be applied to programs at unit and integration testing levels, as well as to software specifications written in a variety of different languages. A fundamental issue to make mutation testing w...

متن کامل

Eecient Logic Variables for Distributed Computing

We de ne a practical algorithm for distributed rational tree uni cation and prove its correctness in both the o -line and on-line cases. We derive the distributed algorithm from a centralized one, showing clearly the trade-o s between local and distributed execution. The algorithm is used to realize logic variables in the Mozart Programming System, which implements the Oz language (see http://w...

متن کامل

A state abstraction for coordination in Java-like languages⋆

Objects’ state, intended as some abstraction over the value of fields, is always in the mind of a COOL (Concurrent Object-Oriented Language) programmer. In fact, as the state of an object changes so does its coordination behaviour. We introduce a language feature for expressing the notion of state in Java-like languages. The proposed feature takes the form of state class, a new kind of class, e...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001